The core and related solution concepts for infinite assignment games
نویسندگان
چکیده
منابع مشابه
Semi-infinite assignment problems and related games
In 1972 Shapley and Shubik introduced assignment games associated to finite assignment problems in which two types of agents were involved and they proved that these games have a non-empty core. In this paper we look at the situation where the set of one type is infinite and investigate when the core of the associated game is non-empty. Two infinite programming problems arise here, which we tac...
متن کاملSolution Concepts and Algorithms for Infinite Multiplayer Games
We survey and discuss several solution concepts for infinite turn-based multiplayer games with qualitative (i.e. win-lose) objectives of the players. These games generalise in a natural way the common model of games in verification which are two-player, zero-sum games with ω-regular winning conditions. The generalisation is in two directions: our games may have more than two players, and the ob...
متن کاملCore Equivalence Theorems for Infinite Convex Games
We show that the core of a continuous convex game on a measurable space of players is a von Neumann Morgenstern stable set. We also extend the definition of the Mas Colell bargaining set to games with a measurable space of players and show that for continuous convex games the core may be strictly included in the bargaining set but it coincides with the set of all countably additive payoff measu...
متن کاملCore Concepts for Dynamic TU Games
This paper is concerned with the question of how to de ne the core when cooperation takes place in a dynamic setting. The focus is on dynamic cooperative games in which the players face a nite sequence of exogenously speci ed TU-games. Three di erent core concepts are presented: the classical core, the strong sequential core and the weak sequential core. The di erences between the concepts aris...
متن کاملOn the complexity of undominated core and farsighted solution concepts in coalitional games
In this paper, we study the computational complexity of solution concepts in the context of coalitional games. Firstly, we distinguish two different kinds of core, the undominated core and excess core, and investigate the difference and relationship between them. Secondly, we thoroughly investigate the computational complexity of undominated core and three farsighted solution concepts—farsighte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Top
سال: 2004
ISSN: 1134-5764,1863-8279
DOI: 10.1007/bf02578965